On Negative Binomial Approximation to k-Runs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON NEGATIVE BINOMIAL APPROXIMATION TO k-RUNS

The distributions of the run occurrences for a sequence of independent and identically distributed (i.i.d.) experiments are usually obtained by combinatorial methods (see Balakrishnan and Koutras (2002, Chapter 5)) and the resulting formulae are often very tedious, while the distributions for non i.i.d. experiments are generally intractable. It is therefore of practical interest to find a suita...

متن کامل

GENERALIZED BINOMIAL AND NEGATIVE BINOMIAL DISTRIBUTIONS OF ORDER k BY THE/-OVERLAPPING ENUMERATION SCHEME

A b s t r a c t . In this paper, we investigate the exact distribution of the waiting time for the r-th t-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of order k and an extended Poisson distr...

متن کامل

On the normal approximation to symmetric binomial distributions

The optimal constant over square root of n error bound in the central limit theorem for distribution functions of sums of independent symmetric Bernoulli random variables is 1/ √ 2πn.

متن کامل

Simultaneous Rational Approximation to Binomial Functions

We apply Padé approximation techniques to deduce lower bounds for simultaneous rational approximation to one or more algebraic numbers. In particular, we strengthen work of Osgood, Fel’dman and Rickert, proving, for example, that max {∣∣∣√2− p1/q∣∣∣ , ∣∣∣√3− p2/q∣∣∣} > q−1.79155 for q > q0 (where the latter is an effective constant). Some of the Diophantine consequences of such bounds will be d...

متن کامل

On approximation of Markov binomial distributions

For a Markov chain X = {Xi, i = 1, 2, . . . , n} with the state space {0, 1}, the random variable S := ∑n i=1 Xi is said to follow a Markov binomial distribution. The exact distribution of S, denoted as LS, is very computationally intensive for large n [see Gabriel (1959) and Bhat and Lal (1988)] and this paper concerns suitable approximate distributions for LS when X is stationary. We conclude...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2008

ISSN: 0021-9002,1475-6072

DOI: 10.1017/s0021900200004356